Integer valued polynomials over function fields

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integer-valued Polynomials over Quaternion Rings

When D is an integral domain with field of fractions K, the ring Int(D) = {f(x) ∈ K[x] | f(D) ⊆ D} of integer-valued polynomials over D has been extensively studied. We will extend the integer-valued polynomial construction to certain noncommutative rings. Specifically, let i, j, and k be the standard quaternion units satisfying the relations i = j = −1 and ij = k = −ji, and define ZQ := {a+bi+...

متن کامل

Integer-valued Polynomials

Let R be a Krull ring with quotient field K and a1, . . . , an in R. If and only if the ai are pairwise incongruent mod every height 1 prime ideal of infinite index in R does there exist for all values b1, . . . , bn in R an interpolating integer-valued polynomial, i.e., an f ∈ K[x] with f(ai) = bi and f(R) ⊆ R. If S is an infinite subring of a discrete valuation ring Rv with quotient field K a...

متن کامل

Integer-valued Polynomials on Algebras

Let D be a domain with quotient field K and A a D-algebra. A polynomial with coefficients in K that maps every element of A to an element of A is called integer-valued on A. For commutative A we also consider integer-valued polynomials in several variables. For an arbitrary domain D and I an arbitrary ideal of D we show I -adic continuity of integer-valued polynomials on A. For Noetherian one-d...

متن کامل

FUZZY HYPERVECTOR SPACES OVER VALUED FIELDS

In this note we first redefine the notion of a fuzzy hypervectorspace (see [1]) and then introduce some further concepts of fuzzy hypervectorspaces, such as fuzzy convex and balance fuzzy subsets in fuzzy hypervectorspaces over valued fields. Finally, we briefly discuss on the convex (balanced)hull of a given fuzzy set of a hypervector space.

متن کامل

What are Rings of Integer-Valued Polynomials?

Every integer is either even or odd, so we know that the polynomial f(x) = x(x− 1) 2 is integervalued on the integers, even though its coefficients are not in Z. Similarly, since every binomial coefficient ( k n ) is an integer, the polynomial ( x n ) = x(x− 1)...(x− n+ 1) n! must also be integervalued. These polynomials were used for polynomial interpolation as far back as the 17 century. Inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indagationes Mathematicae (Proceedings)

سال: 1988

ISSN: 1385-7258

DOI: 10.1016/s1385-7258(88)80009-x